COCA: Constructing optimal clustering architecture to maximize sensor network lifetime

نویسندگان

  • Huan Li
  • Yanlei Liu
  • Weifeng Chen
  • Weijia Jia
  • Bing Li
  • Junwu Xiong
چکیده

In wireless sensor networks, clustering is an effective technique to extend the network lifetime. However, in the multi-hop clustering model, if the nodes are uniformly distributed and the clusters are of equal size, the cluster heads closer to the sink have to relay much heavier traffic, leading to the ‘‘energy hole’’ problem. Unequal clustering structures have been proposed to mitigate the ‘‘energy hole’’ problem; but, how to quantify the cluster sizes for the aim of scalability and energy hole avoidance remains as a challenging problem. In this paper, we first investigate the theoretical issues of the unequal clustering strategy in uniformly distributed sensor networks. We then propose a method to construct optimal clustering architecture to minimize the total energy consumption of all sensor nodes. Furthermore, we design simple but effective and distributed protocols for energy-aware cluster-head rotation and routing that achieve even energy consumption among all nodes. Extensive simulations show that the performance of our approach extends the network lifetime in two to three times of the one achieved in the best-sofar unequal clustering-based routing. 2012 Elsevier B.V. All rights reserved.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An Artificial Bee Colony Inspired Clustering Solution to Prolong Lifetime of Wireless Sensor Networks

It is very difficult and expensive to replace sensor node battery in wireless sensor network in many critical conditions such as bridge supervising, resource exploration in hostile locations, and wildlife safety, etc. The natural choice in such situations is to maximize network lifetime. One such approach is to divide the sensing area of wireless sensor network into clusters to achieve high ene...

متن کامل

An Adaptive LEACH-based Clustering Algorithm for Wireless Sensor Networks

LEACH is the most popular clastering algorithm in Wireless Sensor Networks (WSNs). However, it has two main drawbacks, including random selection of cluster heads, and direct communication of cluster heads with the sink. This paper aims to introduce a new centralized cluster-based routing protocol named LEACH-AEC (LEACH with Adaptive Energy Consumption), which guarantees to generate balanced cl...

متن کامل

درخت تجمیع داده براساس الگوریتم پویای شکل گیری رودخانه درشبکه حسگر بی سیم

One of the main challenges in Wireless Sensor Networks is the limited energy of nodes which can cause to reduce the lifetime of nodes and whole network respectively. Transmissions between the nodes consumes most of the nodes' energy so minimization of unnecessary transmissions can led to reduction of energy consumption. Therefor routing protocols designed based on optimal energy consumption are...

متن کامل

A Hierarchy Topology Design Using a Hybrid Evolutionary Algorithm in Wireless Sensor Networks

Wireless sensor network a powerful network contains many wireless sensors with limited power resource, data processing, and transmission abilities. Wireless sensor capabilities including computational capacity, radio power, and memory capabilities are much limited. Moreover, to design a hierarchy topology, in addition to energy optimization, find an optimum clusters number and best location of ...

متن کامل

Multi-layer Clustering Topology Design in Densely Deployed Wireless Sensor Network using Evolutionary Algorithms

Due to the resource constraint and dynamic parameters, reducing energy consumption became the most important issues of wireless sensor networks topology design. All proposed hierarchy methods cluster a WSN in different cluster layers in one step of evolutionary algorithm usage with complicated parameters which may lead to reducing efficiency and performance. In fact, in WSNs topology, increasin...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Computer Communications

دوره 36  شماره 

صفحات  -

تاریخ انتشار 2013